منابع مشابه
On the Convex Feasibility Problem
The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection...
متن کاملThe Convex Feasibility Problem in Image Recovery∗
2 Mathematical Foundations 11 2.1 General Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2 Geometrical Properties of Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3 Strong and Weak Topologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.4 Convex Functionals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملWireless network positioning as a convex feasibility problem
In this semi-tutorial paper, the positioning problem is formulated as a convex feasibility problem (CFP). To solve the CFP for non-cooperative networks, we consider the well-known projection onto convex sets (POCS) technique and study its properties for positioning. We also study outer-approximation (OA) methods to solve CFP problems. We then show how the POCS estimate can be upper bounded by s...
متن کاملGeometric analysis of the condition of the convex feasibility problem
The focus of this paper is the homogeneous convex feasibility problem, which is the following question: Given an m-dimensional subspace of R, does this subspace intersect a fixed convex cone solely in the origin or are there further intersection points? This problem includes as special cases the linear, the second order, and the semidefinite feasibility problems, where one simply chooses the po...
متن کاملHilbertian Convex Feasibility Problem: Convergence of Projection Methods∗
The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are made on the regularity of the sets and various strategies are considered to control the order in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2019
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-019-00806-w